BRAIDED LINE AND COUNTING FIXED POINTS OF GL(d,Fq)
نویسندگان
چکیده
We interpret a recent formula for counting orbits of GL(d, Fq) in terms of counting fixed points as addition in the affine braided line. The theory of such braided groups (or Hopf algebras in braided categories) allows us to obtain the inverse relationship, which turns out to be the same formula but with q and q interchanged (a perfect duality between counting orbits and counting fixed points). In particular, the probability that an element of GL(d, Fq) has no fixed points is found to be the truncated q-exponential de − 1 q−1 q = d ∑ i=0 (−1) (qi − 1) · · · (q − 1) .
منابع مشابه
Counting rational points on ruled varieties over function fields
Let K be the function field of an algebraic curve C defined over a finite field Fq. Let V ⊂ PK be a projective variety which is a union of lines. We prove a general result computing the number of rational points of bounded height on V/K. We first compute the number of rational points on a general line defined over K, and then sum over the lines covering V . Mathematics Subject Classification: 1...
متن کاملTwisted cohomology of configuration spaces of the plane and spaces of maximal tori via point-counting
We consider two families of algebraic varieties Yn indexed by natural numbers n: the configuration space of unordered n-tuples of distinct points on C, and the space of unordered n-tuples of linearly independent lines in C. Let Wn be any sequence of virtual Sn-representations given by a character polynomial, we compute H(Yn;Wn) for all i and all n in terms of double generating functions. One co...
متن کاملCounting Using Hall Algebras Ii. Extensions from Quivers
We count the Fq-rational points of GIT quotients of quiver representations with relations. We focus on two types of algebras – one is one-point extended from a quiver Q, and the other is the Dynkin A2 tensored with Q. For both, we obtain explicit formulas. We study when they are polynomial-count. We follow the similar line as in the first paper but algebraic manipulations in Hall algebra will b...
متن کاملCounting Value Sets: Algorithm and Complexity
Let p be a prime. Given a polynomial in Fpm [x] of degree d over the finite field Fpm , one can view it as a map from Fpm to Fpm , and examine the image of this map, also known as the value set. In this paper, we present the first non-trivial algorithm and the first complexity result on explicitly computing the cardinality of this value set. We show an elementary connection between this cardina...
متن کاملCounting Rational Points on Cubic Hypersurfaces: Corrigendum
R0<b162R0 gcd(b1, N )1/2 R 0 (HP) . The second line is false and in fact one has M1 = 1 in Proposition 3. The author is very grateful to Professor Hongze Li for drawing his attention to this flaw. The error can be fixed by introducing an average over b1 into the statement of Proposition 3. This allows us to recover the main theorem in [1], and also [2, Lemma 11], via the following modification....
متن کامل